A Tableau Calculus for Combining Non-disjoint Theories

Combining Integer Programming and Tableau-based Reasoning: a Hybrid Calculus for the Description Logic Shq

Combining Integer Programming and Tableau-based Reasoning: A Hybrid Calculus for the Description Logic SHQ

A Gentle Non-disjoint Combination of Satisfiability Procedures

A satisfiability problem is often expressed in a combination of theories, and a natural approach consists in solving the problem by combining the satisfiability procedures available for the component theories. This is the purpose of the combination method introduced by Nelson and Oppen. However, in its initial presentation, the Nelson-Oppen combination method requires the theories to be signatu...

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

We present a novel technique to combine satisfiability procedures for theories that model some data-structures and that share the integer offsets. This procedure extends the Nelson-Oppen approach to a family of non-disjoint theories that have practical interest in verification. The result is derived by showing that the considered theories satisfy the hypotheses of a general result on non-disjoi...

Combining Non-Disjoint Theories?

A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics

Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equa...